Nearest Neighbor Estimators for Random Fields
نویسندگان
چکیده
منابع مشابه
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
The problem of hypothesis testing against independence for a Gauss-Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, a closed-form expression for the log-likelihood ratio is derived, in terms of the coefficients of its covariance matrix and the edges of the dependency graph. Assuming random placement of nodes over a large region according to the Poisson or uniform di...
متن کاملkn-Nearest Neighbor Estimators of Entropy
For estimating the entropy of an absolutely continuous multivariate distribution, we propose nonparametric estimators based on the Euclidean distances between the n sample points and their kn-nearest neighbors, where {kn : n = 1, 2, . . .} is a sequence of positive integers varying with n. The proposed estimators are shown to be asymptotically unbiased and consistent.
متن کاملNearest-neighbor entropy estimators with weak metrics
A problem of improving the accuracy of nonparametric entropy estimation for a stationary ergodic process is considered. New weak metrics are introduced and relations between metrics, measures, and entropy are discussed. Based on weak metrics, a new nearest-neighbor entropy estimator is constructed and has a parameter with which the estimator is optimized to reduce its bias. It is shown that est...
متن کاملN-Fields: Neural Network Nearest Neighbor Fields for Image Transforms
We propose a new architecture for difficult image processing operations, such as natural edge detection or thin object segmentation. The architecture is based on a simple combination of convolutional neural networks with the nearest neighbor search. We focus our attention on the situations when the desired image transformation is too hard for a neural network to learn explicitly. We show that i...
متن کاملNearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 1993
ISSN: 0047-259X
DOI: 10.1006/jmva.1993.1002